منابع مشابه
Modular Extensions for Modular (Logic) Languages
We address the problem of developing mechanisms for easily implementing modular extensions to modular (logic) languages. By (language) extensions we refer to different groups of syntactic definitions and translation rules that extend a language. Our use of the concept of modularity in this context is twofold. We would like these extensions to be modular, in the sense above, i.e., we should be a...
متن کاملAn Abstract Interpreter for Improving the Eciency of Dynamic Modular Logic Languages an Abstract Interpreter for Improving the Eciency of Dynamic Modular Logic Languages
In this work, we focus on modular logic languages where module composition is performed through union of clauses and where the set of denitions to be used in order to evaluate a goal can be extended during the computation through implication goals. In order to improve the implementation of these languages, we consider the application of static analysis techniques. In particular, we apply abstra...
متن کاملOptimizing Description Logic Subsumption
Effective optimization techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. With currently-available desktop computers, systems that incorporate these techniques can effectively reason in description logics with intractable inference. Because of the correspondence between description logics and propositional mod...
متن کاملModular Markovian Logic
We introduce Modular Markovian Logic (MML) for compositional continuous-time and continuous-space Markov processes. MML combines operators specific to stochastic logics with operators reflecting the modular structure of the models, similar to those used by spatial and separation logics. We present a complete Hilbert-style axiomatization for MML, prove the small model property and analyze the re...
متن کاملModular Temporal Logic
Th erien and Wilke characterized the Until hierarchy of linear temporal logic in terms of aperiodic monoids. Here, a temporal operator able to count modulo q is introduced. Temporal logic augmented with such operators is found decidable as it is shown to express precisely the solvable regular languages. Natural hierarchies are shown to arise when modular and conventional operators are interleav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Computing Surveys
سال: 1998
ISSN: 0360-0300,1557-7341
DOI: 10.1145/289121.289131